Instead of ‘supremacy’ use ‘quantum advantage’
نویسندگان
چکیده
منابع مشابه
Complexity-Theoretic Foundations of Quantum Supremacy Experiments
In the near future, there will likely be special-purpose quantum computers with 40-50 high-quality qubits. This paper lays general theoretical foundations for how to use such devices to demonstrate “quantum supremacy”: that is, a clear quantum speedup for some task, motivated by the goal of overturning the Extended Church-Turing Thesis as confidently as possible. First, we study the hardness of...
متن کاملCharacterizing Quantum Supremacy in Near-Term Devices
Sergio Boixo, Sergei V. Isakov, Vadim N. Smelyanskiy, Ryan Babbush, Nan Ding, Zhang Jiang, 4 John M. Martinis, 6 and Hartmut Neven Google Inc., Venice, CA 90291, USA Google Inc., 8002 Zurich, Switzerland QuAIL, NASA Ames Research Center, Moffett Field, CA 94035, USA SGT Inc., 7701 Greenbelt Rd., Suite 400, Greenbelt, MD 20770 Google Inc., Santa Barbara, CA 93117, USA Department of Physics, Univ...
متن کاملAchieving quantum supremacy with sparse and noisy commuting quantum computations
The class of commuting quantum circuits known as IQP (instantaneous quantum polynomialtime) has been shown to be hard to simulate classically, assuming certain complexity-theoretic conjectures. Here we study the power of IQP circuits in the presence of physically motivated constraints. First, we show that there is a family of sparse IQP circuits that can be implemented on a square lattice of n ...
متن کاملAncilla-driven instantaneous quantum polynomial time circuit for quantum supremacy
Instantaneous quantum polynomial time (IQP) is a model of (probably) non-universal quantum computation. Since it has been proven that IQP circuits are unlikely to be simulated classically up to a multiplicative error and an error in the l1 norm, IQP is considered as one of the promising classes that demonstrates quantum supremacy. Although IQP circuits can be realized more easily than a univers...
متن کاملQuantum Supremacy and the Complexity of Random Circuit Sampling
A critical milestone on the path to useful quantum computers is quantum supremacy – a demonstration of a quantum computation that is prohibitively hard for classical computers. A leading near-term candidate, put forth by the Google/UCSB team, is sampling from the probability distributions of randomly chosen quantum circuits, which we call Random Circuit Sampling (RCS). In this paper we study bo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 2019
ISSN: 0028-0836,1476-4687
DOI: 10.1038/d41586-019-03781-0